Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
نویسندگان
چکیده
In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum Kolmogorov complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.
منابع مشابه
Brudno's theorem for Zd (or Zd+) subshifts
We generalize Brudno’s theorem of 1-dimensional shift dynamical system to Z (or Zd+) subshifts. That is to say, in Z d (or Zd+) subshift, the Kolmogorov-Sinai entropy is equivalent to the Kolmogorov complexity density almost everywhere for an ergodic shift-invariant measure. Mathematics Subject Classification (2010). 68Q30, 28Dxx, 37B10, 82B20.
متن کاملCalculation of Kolmogorov Entropy in Cavity Quantum Electrodynamics
In this paper Kolomogorov entropy of a simulated cavity quantum electrodynamics in a multi-partite system consisting of eight quantum dots in interaction with one cavity mode has been estimated. It has been shown that the Kolmogorov Entropy monotonically increases with the increasing coupling strength, which is a sufficient condition for chaotic behavior under ultrastrong coupling regime. The a...
متن کاملQuantum Dynamical Entropies and Gács Algorithmic Entropy
Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov–Sinai (dynamical) entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm. A theorem of Brudno establishes that the complexity per unit time step along typical trajectories of a classical ergodic system equals the KS-entropy. In the following,...
متن کاملQuantum Entropy and Complexity
We study the relations between the recently proposed machine-independent quantum complexity of P. Gacs [1] and the entropy of classical and quantum systems. On one hand, by restricting Gacs complexity to ergodic classical dynamical systems, we retrieve the equality between the Kolmogorov complexity rate and the Shannon entropy rate derived by A.A. Brudno [2]. On the other hand, using the quantu...
متن کاملQuantum Kolmogorov Complexity and Information-Disturbance Theorem
In this paper, a representation of the information-disturbance theorem based on the quantum Kolmogorov complexity that was defined by P. Vitányi has been examined. In the quantum information theory, the information-disturbance relationship, which treats the trade-off relationship between information gain and its caused disturbance, is a fundamental result that is related to Heisenberg’s uncerta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/quant-ph/0506080 شماره
صفحات -
تاریخ انتشار 2005